Distances and Riemannian Metrics for Multivariate Spectral Densities
نویسندگان
چکیده
منابع مشابه
Distances between power spectral densities
We present several natural notions of distance between spectral density functions of (discrete-time) random processes. They are motivated by certain filtering problems. First we quantify the degradation of performance of a predictor which is designed for a particular spectral density function and then used to predict the values of a random process having a different spectral density. The logari...
متن کاملON THE LIFTS OF SEMI-RIEMANNIAN METRICS
In this paper, we extend Sasaki metric for tangent bundle of a Riemannian manifold and Sasaki-Mok metric for the frame bundle of a Riemannian manifold [I] to the case of a semi-Riemannian vector bundle over a semi- Riemannian manifold. In fact, if E is a semi-Riemannian vector bundle over a semi-Riemannian manifold M, then by using an arbitrary (linear) connection on E, we can make E, as a...
متن کاملFinslerian Metrics in the Cone of Spectral Densities
The paper generalises Thompson and Hilbert metric to the space of spectral densities. The resulting complete metric space has the differentiable structure of a Finsler manifold with explicit geodesics. Additionally, in the rational case, the resulting distance is filtering invariant and can be computed efficiently.
متن کاملSobolev Metrics on the Riemannian Manifold of All Riemannian Metrics
On the manifold M(M) of all Riemannian metrics on a compact manifold M one can consider the natural L-metric as decribed first by [10]. In this paper we consider variants of this metric which in general are of higher order. We derive the geodesic equations, we show that they are well-posed under some conditions and induce a locally diffeomorphic geodesic exponential mapping. We give a condition...
متن کاملRiemannian metrics for neural networks
We describe four algorithms for neural network training, each adapted to different scalability constraints. These algorithms are mathematically principled and invariant under a number of transformations in data and network representation, from which performance is thus independent. These algorithms are obtained from the setting of differential geometry, and are based on either the natural gradi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2012
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2012.2183171